On the Parameters of Convolutional Codes with Cyclic Structure
نویسندگان
چکیده
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the parameters (field size, length, dimension, and Forney indices) can occur for cyclic codes. We will investigate whether all these combinations can indeed be realized by a suitable cyclic code and, if so, how to construct such a code. A complete characterization and construction will be given for minimal cyclic codes. It is derived from a detailed investigation of the units in the skew-polynomial ring.
منابع مشابه
On the Algebraic Parameters of Convolutional Codes with Cyclic Structure
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [4] that only certain combinations of the algebraic parameters (field size, length, dimension, and Forney indices) can occur for such cyclic codes. We will investigate whether all these combinations can inde...
متن کاملA matrix ring description for cyclic convolutional codes
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the...
متن کاملBLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملOn MDS convolutional Codes over $\mathbb Z_{p^r}$
Resumo Maximum Distance Separable (MDS) convolutional codes are characterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Zpr was recently discovered in [26] via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Zpr from a new perspectiv...
متن کاملQuasi-cyclic self-dual codes of length 70
In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure double circulant i.e. could not be represented in systematic form. Keywords—convolutional encoding, quasi-cyclic codes weight enumeratorg, double circulant
متن کامل